Couillard: Parallel programming via coarse-grained Data-flow Compilation
نویسندگان
چکیده
منابع مشابه
Couillard: Parallel programming via coarse-grained Data-flow Compilation
Data-flow is a natural approach to parallelism. However, describing dependencies and control between finegrained data-flow tasks can be complex and present unwanted overheads. TALM (TALM is an Architecture and Language for Multi-threading) introduces a user-defined coarse-grained parallel data-flow model, where programmers identify code blocks, called superinstructions, to be run in parallel an...
متن کاملA New Coarse-Grained Reconfigurable Architecture with Fast Data Relay and Its Compilation Flow
{luwan2, cdong3, dchen}@illinois.edu Enabling Hardware Support for Fast Data Relay Architectural overview: Host CPU initializes the kernel computation on our FDR-CGRA. DMA is in charge of system-level dataflow. FDR-CGRA can focus on accelerating time-consuming kernels. Processing elements: Support concurrent computation and communication with dedicated computing path and bypassing path for Fast...
متن کاملCoarse-Grained Distributed Parallel Programming Interface for Grid Computing
In this paper, a practical coarse-grained distributed parallel programming interface for grid computing (PI4GC) is introduced. It provides a group of generic and abstract function prototypes with well-specified semantics. PI4GC is an MPI-like interface plus high-level parallel tasking over grid. Following its specification, users could couple multiple computing tools distributed over grid to ru...
متن کاملCoarse-Grained Parallel Geometric Search
We present a parallel algorithm for solving the next element search problem on a set of line segments, using a BSP like model referred to as the Coarse Grained Multicomputer (CGM). The algorithm requires O(1) communication rounds (h-relations with h = O(n/p)), O((n/p) log n) local computation, and O((n/p) log p) memory per processor, assuming n/p ≥ p. Our result implies solutions to the point l...
متن کاملCoarse-grained Parallel Computing on Heterogeneous Systems Heterogeneous Coarse-grained Parallel Computing
We consider the problem of nding eecient parallel algorithms for heterogeneous parallel computers, i.e., parallel computers in which dierent processors have dier-ent computational potential. To this end, we dene a formal computational model for heterogeneous systems and develop algorithms for commonly used communication operations. The result is that many existing parallel algorithms which use ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2014
ISSN: 0167-8191
DOI: 10.1016/j.parco.2014.10.002